Compact XOR-bi-decomposition for lattices of Boolean functions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Derivative Operations for Lattices of Boolean Functions

This paper explores derivative operations of the Boolean differential calculus for lattices of Boolean functions. Such operations are needed to design circuits with short delay and low power consumption [3] as well as to calculate minimal complete sets of fitting test patterns [4]. It will be shown that each derivative operation of a lattice of Boolean functions creates again a lattice of Boole...

متن کامل

Unate Decomposition of Boolean Functions

We propose a new way of decomposing completely or incompletely specified Boolean functions into a set of unate functional blocks to obtain a good initial structure for logic synthesis. The input to our algorithm is a flattened netlist. The output is a multi-level netlist that can be efficiently implemented using a logic synthesis tool. Experimental results on Espresso PLA benchmarks employing a...

متن کامل

Generalized Lattices of Boolean Functions Utilized for Derivative Operations

This paper explores lattices of Boolean functions which are built by derivative operations of the Boolean Differential Calculus [2], [8], [9]. Such operations are needed to design circuits with short delay and low power consumption [11] as well as to calculate minimal complete sets of fitting test patterns [12]. It will be shown that each derivative operation of a lattice of Boolean functions c...

متن کامل

Decomposition of Multi-Output Boolean Functions∗

In this paper the problem of decomposition, mapping and minimization of multi-output boolean functions is discussed. First the mathematical formulation for single-output boolean functions is presented and then it is extended to multi-output functions. The proposed formulations use function decompositions, ETDDs (EXOR ternary decision diagrams) and multi-valued logic.

متن کامل

On the Decomposition of Boolean Functions via Boolean Equations

We propose an alternative solution to the problems solved in [1]. Our aim is to advocate the efficiency of algebraic methods for the solution of the Boolean equations which occur in the decomposition of Boolean functions.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Facta universitatis - series: Electronics and Energetics

سال: 2018

ISSN: 0353-3670,2217-5997

DOI: 10.2298/fuee1802223s